Bresenham's Line Generation Algorithm with Built-in Clipping
نویسنده
چکیده
One of the most important operations in many graphical systems is the generation of a line segment. This process consists of two stages: clipping and drawing. These two stages are separated in current graphical applications. In this paper a new approach to line generation is proposed, which unifies these stages. The proposed algorithm is based on Bresenham’s line generation algorithm to include necessary line clipping. The line clipping stage is an operation-reduced, integer arithmetic only algorithm. The notion of correctness of line clipping is introduced and correctness of the proposed algorithm is shown. Complete C-notation of the algorithm is included.
منابع مشابه
Line Drawing Algorithm on an Interleaved Grid
In this paper Bresenham's line drawing algorithm on interleaved grid is proposed. It uses the advantages of interleaved sampling to scan-convert the pixel on the raster with less
متن کاملThree dimensional extension of Bresenham's Algorithm with Voronoi diagram
This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the co...
متن کاملA Novel Pixel Line Based Algorithm for Line Generation
Abstract Straight line is the most basic element of graphics, and it is of great significance to study fast algorithm of line generating. On the basis of Bresenham algorithm, this paper considers and takes full advantage of the relativity between adjacent pixels in the line, and can generate all the pixels in a pixel line every time. The new algorithm based on pixel line can guarantee the line ...
متن کاملTechnical Section EFFICIENT INTEGER ALGORITHMS FOR THE GENERATION OF CONIC SECTIONS
ÐEcient integer 8-connected algorithms for the fast generation of Conic Sections whose axes are aligned to the coordinate axes are described based on a Bresenham-like methodology. Performance results show that in the case of the ellipse, the algorithm is at least as fast as other known integer algorithms but requires lower integer range and always performs correct region transitions. Antialias...
متن کاملThe periodicity of integral convex hulls for conics in r2
We present a method to construct the boundary of the integral convex hull of conics in the plane. This work may be related to a previous problem (constructing a circle or an ellipse by Bresenham's algorithm 3]), but is more general, complex and its solution involves strong arithmetic properties of the conics.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Graph. Forum
دوره 14 شماره
صفحات -
تاریخ انتشار 1995